EARTHQUAKE RESISTANT DESIGN OF PC FRAME WITH PC-MILD-PRESS JOINTS
نویسندگان
چکیده
منابع مشابه
PCPC PC PC PCPC PCPC PC PC PCPC PC PC ( a ) 2 - ary 4 - tree PC PC PCPC PC PC PCPC PC PC PCPC PC PC
Many applications have stimulated the recent surge of interest single-chip parallel processing. In such machines, it is crucial to implement a high-throughput low-latency interconnection network to connect the on-chip components, especially the processing units and the memory units. In this paper, we propose a new mesh of trees (MoT) implementation of the interconnection network and evaluate it...
متن کاملJKimmo: A Multilingual Computational Morphology Frame- work for PC-KIMMO
Morphological analysis is of fundamental interest in computational linguistics and language processing. While there are established morphological analyzers for mostly Western and a few other languages using localized interfaces, the same cannot be said for Indic and other less-studied languages for which language processing is just beginning. There are three primary obstacles to computational m...
متن کاملPc - Atomic
ABSTRACT: PC-ATOMIC is a PC interface for the ATOMIC LAN. PCATOMIC is implemented as a VL-Bus (VESA) short-form card for Intel i486 PCs, providing an interface for low-cost workstations to a 640 Mbps LAN. This document describes the PC-ATOMIC interface, its design, capabilities, and performance. The board design is public, and a small number of boards are available as government-furnished equip...
متن کاملSpss/pc+
news. If you create conditions incompatible with life, the program lets you know your patient is dead, this is the MacMan equivalent of crashing your airplane in a flight simulator, and should this happen you merely start again, because there is no equivalent to reversing the program and resurrecting the dead. Some of the experiment options include: cutting the buffer nerves, resetting barorece...
متن کاملPC-Labeling of a Graph and its PC-Set
Abstract A binary vertex labeling f : V (G) → Z2 of a graph G is said to be friendly if the number of vertices labeled 0 is almost the same as the number of vertices labeled 1. This friendly labeling induces an edge labeling f∗ : E(G) → Z2 defined by f∗(uv) = f(u)f(v) for all uv ∈ E(G). Let ef (i) = {uv ∈ E(G) : f∗(uv) = i} be the number of edges of G that are labeled i. Productcordial index of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Structural and Construction Engineering (Transactions of AIJ)
سال: 2010
ISSN: 1881-8153,1340-4202
DOI: 10.3130/aijs.75.95